Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
نویسندگان
چکیده
منابع مشابه
Constant-Factor Approximation for TSP with Disks
We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of n disks in the plane, a TSP tour whose length is at most O(1) times the optimal can be computed in time that is polynomial in n. Our result is the first constant-ratio approximation for a class of planar convex bodies of arbitrary size and...
متن کاملAn Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality
We consider the asymmetric traveling salesperson problem with γ-parameterized triangle inequality for γ ∈ [ 1 2 , 1). That means, the edge weights fulfill w(u, v) ≤ γ · (w(u, x) + w(x, v)) for all nodes u, v, x. Chandran and Ram [8] recently gave the first constant factor approximation algorithm with polynomial running time for this problem. They achieve performance ratio γ 1−γ . We devise an a...
متن کاملA Constant-Factor Approximation Algorithm for TSP with Neighborhoods in the Plane
In the Euclidean TSP with neighborhoods (TSPN) problem we seek a shortest tour that visits a given set of n neighborhoods. The Euclidean TSPN generalizes the standard TSP on points. We present the first constant-factor approximation algorithm for TSPN on an arbitrary set of disjoint, connected neighborhoods in the plane. Prior approximation bounds were O(log n), except in special cases. Our app...
متن کاملConstant-factor approximations for Capacitated Arc Routing without triangle inequality
Given an undirected graph with edge costs and edge demands, the Capacitated Arc Routing problem (CARP) asks for minimum-cost routes for equal-capacity vehicles so as to satisfy all demands. Constant-factor polynomial-time approximation algorithms were proposed for CARP with triangle inequality, while CARP was claimed to be NP-hard to approximate within any constant factor in general. Correcting...
متن کاملPerformance Guarantees for the TSP with a Parameterized Triangle Inequality
We consider the approximability of the tsp problem in graphs that satisfy a relaxed form of triangle inequality. More precisely, we assume that for some parameter 1, the distances satisfy the inequality dist(x; y) (dist(x; z) + dist(z; y)) for every triple of vertices x, y, and z. We obtain a 4 approximation and also show that for some > 0 it is np-hard to obtain a (1 +) approximation. Our uppe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.09.017